Convex body domination and weighted estimates with matrix weights
نویسندگان
چکیده
منابع مشابه
Weighted-SVD: Matrix Factorization with Weights on the Latent Factors
The Matrix Factorization models, sometimes called the latent factor models, are a family of methods in the recommender system research area to (1) generate the latent factors for the users and the items and (2) predict users’ ratings on items based on their latent factors. However, current Matrix Factorization models presume that all the latent factors are equally weighted, which may not always...
متن کاملWeighted estimates for rough bilinear singular integrals via sparse domination
We prove weighted estimates for rough bilinear singular integral operators with kernel K(y1, y2) = Ω((y1, y2)/|(y1, y2)|) |(y1, y2)| , where yi ∈ R and Ω ∈ L∞(S2d−1) with ∫ S2d−1 Ωdσ = 0. The argument is by sparse domination of rough bilinear operators, via an abstract theorem that is a multilinear generalization of recent work by CondeAlonso, Culiuc, Di Plinio and Ou, 2016. We also use recent ...
متن کاملWeighted upper domination number
The cardinality of a maximum minimal dominating set of a graph is called its upper domination number. The problem of computing this number is generally NP-hard but can be solved in polynomial time in some restricted graph classes. In this work, we consider the complexity and approximability of the weighted version of the problem in two special graph classes: planar bipartite, split. We also pro...
متن کاملDomination in Convex Bipartite and Convex-round Graphs
A bipartite graph G = (X,Y ;E) is convex if there exists a linear enumeration L of the vertices of X such that the neighbours of each vertex of Y are consecutive in L. We show that the problems of finding a minimum dominating set and a minimum independent dominating set in an n-vertex convex bipartite graph are solvable in time O(n2). This improves previous O(n3) algorithms for these problems. ...
متن کاملMagdalena Lemańska WEAKLY CONVEX AND CONVEX DOMINATION NUMBERS
Two new domination parameters for a connected graph G: the weakly convex domination number of G and the convex domination number of G are introduced. Relations between these parameters and the other domination parameters are derived. In particular, we study for which cubic graphs the convex domination number equals the connected domination number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2017
ISSN: 0001-8708
DOI: 10.1016/j.aim.2017.08.001